By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Discrete Mathematics

Table of Contents
Volume 13, Issue 4, pp. 419-575

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

Subset-Restricted Interchange for Dynamic Min-Max Scheduling Problems

George Steiner and Paul Stephenson

pp. 419-435

Exact Analysis of Exact Change: The k-Payment Problem

Boaz Patt-Shamir, Yiannis Tsiounis, and Yair Frankel

pp. 436-453

Graph Searching and Interval Completion

Fedor V. Fomin and Petr A. Golovach

pp. 454-464

Learning Deterministic Finite Automata from Smallest Counterexamples

Andreas Birkendorf, Andreas Böker, and Hans Ulrich Simon

pp. 465-491

Bounds for Codes Identifying Vertices in the Hexagonal Grid

Gérard D. Cohen, Iiro Honkala, Antoine Lobstein, and Gilles Zémor

pp. 492-504

Approximating Fractional Multicommodity Flow Independent of the Number of Commodities

Lisa K. Fleischer

pp. 505-520

Well-Spaced Labelings of Points in Rectangular Grids

Jeffrey C. Lagarias

pp. 521-534

Learning Polynomials with Queries: The Highly Noisy Case

Oded Goldreich, Ronitt Rubinfeld, and Madhu Sudan

pp. 535-570

Uniqueness of Some Resolution IV Two-Level Regular Fractional Factorial Designs

Hegang Chen and Ching-Shui Cheng

pp. 571-575